翻訳と辞書 |
Database storage structures : ウィキペディア英語版 | Database storage structures
Database tables and indexes may be stored on disk in one of a number of forms, including ordered/unordered flat files, ISAM, heap files, hash buckets, or B+ trees. Each form has its own particular advantages and disadvantages. The most commonly used forms are B+ trees and ISAM. Such forms or structures are one aspect of the overall schema used by a database engine to store information. ==Unordered==
Unordered storage typically stores the records in the order they are inserted. Such storage offers good insertion efficiency (), but inefficient retrieval times (). Typically these retrieval times are better, however, as most databases use indexes on the primary keys, resulting in retrieval times of or for keys that are the same as the database row offsets within the storage system.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Database storage structures」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|